Auflistung nach Schlagwort "Parameterized complexity"

Auflistung nach Schlagwort "Parameterized complexity"

Sortiert nach: Sortierung: Ergebnisse:

  • Backdoors for linear temporal logic 
    Meier, Arne; Ordyniak, Sebastian; Sridharan, Ramanujan; Schindler, Irena (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017)
    In the present paper, we introduce the backdoor set approach into the field of temporal logic for the global fragment of linear temporal logic. We study the parameterized complexity of the satisfiability problem parameterized ...
  • Parameterised Counting in Logspace 
    Haak, Anselm; Meier, Arne; Prakash, Om; Rao, B. V. Raghavendra (New York, NY : Springer, 2023)
    Logarithmic space-bounded complexity classes such as L and NL play a central role in space-bounded computation. The study of counting versions of these complexity classes have lead to several interesting insights into the ...
  • Parameterized aspects of team-based formalisms and logical inference 
    Mahmood, Yasir (Hannover : Institutionelles Repositorium der Leibniz Universität Hannover, 2022)
    Parameterized complexity is an interesting subfield of complexity theory that has received a lot of attention in recent years. Such an analysis characterizes the complexity of (classically) intractable problems by pinpointing ...
  • Parameterized complexity of decision problems in non-classical logics 
    Schindler, Irena (Hannover : Institutionelles Repositorium der Leibniz Universität Hannover, 2018)
    Parameterized complexity is a branch of a computational complexity. The pioneers of this new and promising research field are Downey and Fellows. They suggest to examine the structural properties of a given problem and ...
  • Parameterized complexity of weighted team definability 
    Kontinen, Juha; Mahmood, Yasir; Meier, Arne; Vollmer, Heribert (Cambridge : Cambridge Univ. Press, 2024)
    In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analog of one of the most studied problems in parameterized complexity, the notion of weighted ...